package chen.bupt.datastructure.btree

import java.util


/**
 * Created by chenlingpeng on 2014/12/9.
 */
class BTree(m: Int) {
  var root: BNode = new BNode
}

class BNode {
  var n = 0
  var parent: Option[BNode] = None
  val keys = new util.LinkedList[Int]
  keys.add(Int.MinValue) // 占位
  keys.add(Int.MaxValue)
  val childs = new util.LinkedList[BNode]
  def addKey(k: Int) = {
    n+=1

  }
}